Algorithms for Itinerary Planning in Multimodal Transportation Networks
نویسندگان
چکیده
منابع مشابه
A multiple criteria algorithm for planning the itinerary of mobile sink in wireless sensor networks
The mobile sink can increase the efficiency of wireless sensor networks. It moves in a monitored environment and collects the network nodes information. Thus, by the sink we can balance the power consumption and increases the network lifetime. Determining path of the sink's movement is usually modeled as an optimization problem where finding optimal solutions require collecting value of all the...
متن کاملPath-Planning Algorithms for Public Transportation Systems
Computing travel plans for desired trips in public transportation systems is not exactly the same as finding a shortest driving path in a given area. Path planning in the context of public transportation systems must consider the route constraint that public vehicles serve on particular paths and that passengers cannot order the drivers to change the bus routes. Explicit representation of the r...
متن کاملRoute Planning in Transportation Networks
We survey recent advances in algorithms for route planning in transportation networks. For road networks, we show that one can compute driving directions in milliseconds or less even at continental scale. A variety of techniques provide different trade-offs between preprocessing effort, space requirements, and query time. Some algorithms can answer queries in a fraction of a microsecond, while ...
متن کاملA Priority System for Multimodal and Intermodal Transportation Planning
Prioritization is an increasingly important concept for transportation system planning and programming. The resources for capital improvements to state and regional transportation systems are stagnant or declining. AT the same time, population growth, urban development patterns, and travel behaviors are increasing the demands placed on transportation systems. The number and range of interest gr...
متن کاملTime-Dependent Bi-Objective Itinerary Planning Algorithm: Application in Sea Transportation
A special case of the Time-Dependent Shortest Path Problem (TDSPP) is the itinerary planning problem where the objective is to find the shortest path between a source and a destination node which passes through a fixed sequence of intermediate nodes. In this paper, we deviate from the common approach for solving this problem, that is, finding first the shortest paths between successive nodes in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Intelligent Transportation Systems
سال: 2008
ISSN: 1524-9050
DOI: 10.1109/tits.2007.915650